Simplicity, Relativizations and Nondeterminism
نویسندگان
چکیده
منابع مشابه
Simplicity, Immunity, Relativizations and Nondeterminism
The relation between classes of languages recognized by resource bounded Turing machines remains an evasive subject in computational complexity theory. Especially results settling relationship between deterministic and nondeterministic complexity classes are rare. The interesting case of the relation between the classes of languages recognized by polynomial time bounded deterministic versus pol...
متن کاملImmunity and Simplicity in Relativizations of Probabilistic Complexity Classes
The existence of immune and simple sets in relativizations of the probabilistic polynomial time bounded classes is studied. Some techniques previously used to show similar results for relativizations of P and NP are adapted to the probabilistic classes. Using these results, an exhaustive settling of ail possible strong séparations among these relativized classes is obtained. Résumé. -On étudie ...
متن کاملRelativizations for the Logic-Automata Connection
BDDs and their algorithms implement a decision procedure for Quantified Propositional Logic. BDDs are a kind of acyclic automata. But unrestricted automata (recognizing unbounded strings of bit vectors) can be used to decide monadic second-order logics, which are more expressive. Prime examples are WS1S, a number-theoretic logic, or the string-based logical notation of introductory texts. One p...
متن کاملRelativizations of Randomness and Genericity Notions
A set A is a base for Schnorr randomness if it is Turing reducible to a set R which is Schnorr random relative to A, and the notion of a base for weak 1-genericity can be defined similarly. We show that A is a base for Schnorr randomness if and only if A is a base for weak 1-genericity if and only if the halting set K is not Turing reducible to A. Furthermore, we define a set A to be high for S...
متن کاملQuantum Randomness and Nondeterminism
Does the notion of a quantum randomized or nondeterministic algorithm make sense, and if so, does quantum randomness or nonde-terminism add power? Although reasonable quantum random sources do not add computational power, the discussion of quantum random-ness naturally leads to several deenitions of the complexity of quantum states. Unlike classical string complexity, both deterministic and non...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 1985
ISSN: 0097-5397,1095-7111
DOI: 10.1137/0214012